
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1881. -- [Seerc2008]Lucky cities -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1881: [Seerc2008]Lucky cities</h2><span class=green>Time Limit: </span>1 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>115&nbsp;&nbsp;<span class=green>Solved: </span>32<br>[<a href='submitpage.php?id=1881'>Submit</a>][<a href='problemstatus.php?id=1881'>Status</a>][<a href='bbs.php?id=1881'>Discuss</a>]</center><h2>Description</h2><div class=content>给出一张N个点M条边的无向简单图，其中N≤100000，M≤100000。定义一个有效的“行程”为一个点数为奇数的简单圈，即所有点在圈上只能出现一次。如果一个点至少处于一个“行程”中，那么它被称为“幸运的”，要求求出图中幸运点的数目。</div><h2>Input</h2><div class=content>The first line of input contains a single integer T – a number of 
test cases. Every test case starts with a line containing two integers 
separated by a single space –  N and  M. Each of the next  M lines will 
contain two integers ai and bi separated by a single space – the labels 
of cities that i-th road connects. 
 </div><h2>Output</h2><div class=content>Output should contain T lines – answers for each of the test cases. 
 </div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>1 ≤ T ≤ 77, <br />
0 ≤ N, M ≤ 100000 (105<br />
), <br />
1 ≤ ai < bi ≤ N. </span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>1 <br />
7 7 <br />
1 5 <br />
3 5 <br />
3 7 <br />
1 7 <br />
6 7 <br />
4 7 <br />
4 6 </span></div><h2>HINT</h2>
			<div class=content><p>3</p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search='></a></p></div><center>[<a href='submitpage.php?id=1881'>Submit</a>][<a href='problemstatus.php?id=1881'>Status</a>][<a href='bbs.php?id=1881'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
